Community detection in dense random networks
نویسندگان
چکیده
منابع مشابه
Community Detection in Random Networks
We formalize the problem of detecting a community in a network into testing whether in a given (random) graph there is a subgraph that is unusually dense. We observe an undirected and unweighted graph on N nodes. Under the null hypothesis, the graph is a realization of an Erdös-Rényi graph with probability p0. Under the (composite) alternative, there is a subgraph of n nodes where the probabili...
متن کاملCommunity Detection in Sparse Random Networks
We consider the problem of detecting a tight community in a sparse random network. This is formalized as testing for the existence of a dense random subgraph in a random graph. Under the null hypothesis, the graph is a realization of an Erdös-Rényi graph on N vertices and with connection probability p0; under the alternative, there is an unknown subgraph on n vertices where the connection proba...
متن کاملOverlapping Community Detection in Social Networks Based on Stochastic Simulation
Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...
متن کاملCommunity Detection in Complex Networks with Quantum Random Walks
Complex networks are structurally disordered systems that often display clustering behavior. The emergent clusters, also known as communities, consist of nodes that are more connected among themselves than they are connected with the rest of the network. Analyzing community structure is an important problem in network theory, with numerous applications in different fields. In this work I invest...
متن کاملThreshold Random Walkers for Community Structure Detection in Complex Networks
There exist large amounts of complex networks in different areas nowadays, which have aroused great interest in detecting community structures. Although diverse community detection algorithms have been proposed, most of them perform poorly in large scale complex networks. According some social principles, we proposed a scalable Community Detection method based on Threshold Random walkers, which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2014
ISSN: 0090-5364
DOI: 10.1214/14-aos1208